The q-binomial theorem and spectral symmetry
نویسندگان
چکیده
منابع مشابه
The q-Binomial Theorem and two Symmetric q-Identities
We notice two symmetric q-identities, which are special cases of the transformations of 2φ1 series in Gasper and Rahman’s book (Basic Hypergeometric Series, Cambridge University Press, 1990, p. 241). In this paper, we give combinatorial proofs of these two identities and the q-binomial theorem by using conjugation of 2-modular diagrams.
متن کاملHybrid Proofs of the q-Binomial Theorem and Other Identities
We give “hybrid” proofs of the q-binomial theorem and other identities. The proofs are “hybrid” in the sense that we use partition arguments to prove a restricted version of the theorem, and then use analytic methods (in the form of the Identity Theorem) to prove the full version. We prove three somewhat unusual summation formulae, and use these to give hybrid proofs of a number of identities d...
متن کاملThe Negative q-Binomial
Interpretations for the q-binomial coefficient evaluated at −q are discussed. A (q, t)-version is established, including an instance of a cyclic sieving phenomenon involving unitary spaces. 1. The q-binomial The q-binomial coefficient is defined for integers k and n, with 0 ≤ k ≤ n, and an indeterminate q by
متن کاملA Digital Binomial Theorem
In this article, we demonstrate how the Binomial Theorem in turn arises from a one-parameter generalization of the Sierpinski triangle. The connection between them is given by the sum-of-digits function, s(k), defined as the sum of the digits in the binary representation of k (see [1]). For example, s(3) = s(1·2+1·2) = 2. Towards this end, we begin with a well-known matrix formulation of Sierpi...
متن کاملA note on spectral mapping theorem
This paper aims to present the well-known spectral mapping theorem for multi-variable functions.
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Indagationes Mathematicae
سال: 1993
ISSN: 0019-3577
DOI: 10.1016/0019-3577(93)90047-3